Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations

We study a single batching machine scheduling problem with transportation and deterioration considerations arising from steel production. A set of jobs are transported, one at a time, by a vehicle from a holding area to the single batching machine. The machine can process several jobs simultaneously as a batch. The processing time of a job will increase if the duration from the time leaving the holding area to the start of its processing exceeds a given threshold. The time needed to process a batch is the longest of the job processing times in the batch. The problem is to determine the job sequence for transportation and the job batching for processing so as to minimize the makespan and the number of batches. We study four variations (P1, P2, P3, P4) of the problem with different treatments of the two criteria. We prove that all the four variations are strongly NP‐hard and further develop polynomial time algorithms for their special cases. For each of the first three variations, we propose a heuristic algorithm and analyze its worst‐case performance. For P4, which is to find the Pareto frontier, we provide a heuristic algorithm and an exact algorithm based on branch and bound. Computational experiments show that all the heuristic algorithms perform well on randomly generated problem instances, and the exact algorithm for P4 can obtain Pareto optimal schedules for small‐scale instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 269–285, 2014     

天基预警系统资源调度问题分析

在介绍天基预警系统作战流程,以及天基预警系统资源和任务的分析和描述的基础上,提出天基预警系统资源调度问题,给出其输入输出结构,并以五元组的形式对该问题进行形式化描述。 关键词：天基预警系统、资源调度、形式化描述     

Review of the ordered and proportionate flow shop scheduling research

Ordered flow shop models have appeared in the literature since the mid‐1970s and proportionate flow shop models have appeared since the early 1980s. We provide a detailed review of these models along with some analysis and potential topics for future research. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

基于SWE的空天资源对地观测协同任务规划服务模型

空天协同对地观测是对地观测领域的新趋势。为解决现有空天资源规划调度系统相对独立、协同困难的问题,分析总结了SWE(Sensor Web Enablement)标准,并在此基础上提出了空天资源对地观测协同任务规划服务模型。在此模型中,为实现观测资源共享,建立了空天观测资源传感器描述模型,能够描述典型空天资源的载荷平台、观测机理、定位信息、使用约束和工作特性等信息;为简化观测请求交互流程,基于SOA技术对SWE标准操作进行封装及简化,用户可以在不了解观测平台细节信息的情况下提交观测数据请求。为验证模型有效性,构建了空天资源对地观测协同任务规划实验平台,结果表明该模型具有较强的可实现性和适应性。     

通信受限下分布式多传感器协同跟踪算法

在分布式多传感器目标跟踪系统中,由于局部融合中心(LFC)的物理限制(如:有限的频率信道、处理器容量有限等),只能接收有限个传感器的传送数据。此外,信息传输的方式也将影响传感网的使用寿命,因此,研究了通信受限下的分布式多传感器目标协同跟踪问题。首先对监视区内分布的传感器进行聚类分簇形成若干个子网,接着从通信能耗的角度出发,对传感器采集信息的传递路径进行最优路径规划;进而对子网局部状态进行估计,在子网信息融合中,分别采用最大距离和、最大化信息增量两种准则进行最佳传感器选择,最后通过各子网全局航迹融合实现分布式多传感器协同跟踪。仿真验证了算法的有效性。     

复杂环境下基于多目标粒子群的DWA路径规划算法

针对机器人在障碍物分布密集的复杂环境中运行时,动态窗口法(dynamic window approach,DWA)易出现避障失败或规划不合理的情况,提出一种基于多目标粒子群优化算法(multi-objective particle swarm optimization,MOPSO)的改进DWA规划算法。在建立多障碍物环境覆盖模型的基础上,提出一种障碍物密集度的判断方法;优化DWA算法中的子评价函数;利用改进的MOPSO算法实现DWA权重系数的动态调整,将权重系数的自适应变化问题转化为多目标优化问题;根据路径规划的要求将安全距离和速度作为优化目标,并使用改进的MOPSO算法对相应的多目标优化模型进行优化求解。仿真结果表明,该算法使机器人有效地通过障碍〖BHDWG8,WK10YQ,DK1*2,WK1*2D〗〖XCLXY.TIF;%129%129〗听语音 聊科研与作者互动 物密集区的同时兼顾了运行的安全性和速度,具有更好的路径规划效果。     

舰载对陆巡航导弹规划航路点间距离的计算分析

针对舰载对陆巡航导弹在实际飞行中,其航迹需要参考近似大地线的航线,在充分考虑导弹由海对陆的航路规划过程基础上,提出了易于编程、精度有所改进的空间两点间大地距离的计算方法.该方法在考虑高程的地球椭球模型参数的求取基础上,利用Bowring反解公式重新推导了顾及高程的空间航路点间的计算公式.相关算例表明,该方法提高了导弹规...     

多约束条件下无人机航路规划动态评价方法

针对多约束条件的无人机航路规划评价方法缺乏合理性和动态特性的问题,提出了基于无人机六自由度模型的飞行仿真动态评价方法。分析了无人机航路规划的约束条件和影响航路评价的因素,基于某型无人机六自由度飞行动力学模型和飞行控制系统模型建立了无人机飞行仿真系统模型,将航路规划与评价进行有机结合进而进行航路评价方法软件的设计,通过对无人机沿规划航路的仿真飞行参数进行动态特性分析,以更接近真实情况的仿真手段对多约束条件下的航路规划效果进行评价。结果表明,该方法形象直观的实现了对无人机规划航路的动态综合评价,满足工程需求。     

Batch scheduling with step‐deteriorating processing times to minimize flowtime

Both topics of batch scheduling and of scheduling deteriorating jobs have been very popular among researchers in the last two decades. In this article, we study a model combining these two topics. We consider a classical batch scheduling model with unit‐jobs and batch‐independent setup times, and a model of step‐deterioration of processing times. The objective function is minimum flowtime. The optimal solution of the relaxed version (allowing non‐integer batch sizes) is shown to have a unique structure consisting of two consecutive decreasing arithmetic sequences of batch sizes. We also introduce a simple and efficient rounding procedure that guarantees integer batch sizes. The entire solution procedure requires an effort of O(n) (where nis the number of jobs.) © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost

In the last decade, there has been much progress in understanding scheduling problems in which selfish jobs aim to minimize their individual completion time. Most of this work has focused on makespan minimization as social objective. In contrast, we consider as social cost the total weighted completion time, that is, the sum of the agent costs, a standard definition of welfare in economics. In our setting, jobs are processed on restricted uniform parallel machines, where each machine has a speed and is only capable of processing a subset of jobs; a job's cost is its weighted completion time; and each machine sequences its jobs in weighted shortest processing time (WSPT) order. Whereas for the makespan social cost the price of anarchy is not bounded by a constant in most environments, we show that for our minsum social objective the price of anarchy is bounded above by a small constant, independent of the instance. Specifically, we show that the price of anarchy is exactly 2 for the class of unit jobs, unit speed instances where the finite processing time values define the edge set of a forest with the machines as nodes. For the general case of mixed job strategies and restricted uniform machines, we prove that the price of anarchy equals 4. From a classical machine scheduling perspective, our results establish the same constant performance guarantees for WSPT list scheduling. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012